A group action on noncrossing partitions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noncrossing Partitions for the Group Dn

Abstract. The poset of noncrossing partitions can be naturally defined for any finite Coxeter group W . It is a self-dual, graded lattice which reduces to the classical lattice of noncrossing partitions of {1, 2, . . . , n} defined by Kreweras in 1972 when W is the symmetric group Sn, and to its type B analogue defined by the second author in 1997 when W is the hyperoctahedral group. We give a ...

متن کامل

ON k-NONCROSSING PARTITIONS

In this paper we prove a duality between k-noncrossing partitions over [n] = {1, . . . , n} and k-noncrossing braids over [n − 1]. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to tangled-diagrams [6]. We give a combinatorial interpretation of the bijection in terms of the contraction of arcs of tangled-diagrams. Furthermore it induces by re...

متن کامل

On Trees and Noncrossing Partitions

We give a simple and natural proof of (an extension of) the identity P (k, l, n) = P2(k − 1, l − 1, n − 1). The number P (k, l, n) counts noncrossing partitions of {1, 2, . . . , l} into n parts such that no part contains two numbers x and y, 0 < y − x < k. The lower index 2 indicates partitions with no part of size three or more. We use the identity to give quick proofs of the closed formulae ...

متن کامل

On the Noncrossing Partitions of a Cycle

This article defines the paritions of a finite set structured in a cycle which possesses the property that a pair of points belonging to a class and a pair of points belonging to another class cannot be in a crossed way. It establishes that these partitions form a lattice and it specifies some of the descriptive and enumerative properties of the lattice; it computes in particular the Möbius fun...

متن کامل

ON 2-REGULAR, k-NONCROSSING PARTITIONS

In this paper we prove a bijection between 2-regular, k-noncrossing partitions and k-noncrossing enhanced partitions. Via this bijection we enumerate 2-regular, 3-noncrossing partitions using an enumeration result [1] for enhanced 3-noncrossing partitions. In addition we derive the asymptotics for the numbers of 2-regular, 3-noncrossing partitions using the BirkhoffTrijtzinky analytic theory of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2013

ISSN: 0012-365X

DOI: 10.1016/j.disc.2013.04.035